Generalized Connectionist Associative Memory

نویسندگان

  • Nigel P. Duffy
  • Arun K. Jagota
چکیده

This paper presents a generalized associative memory model, which stores a collection of tuples whose components are sets rather than scalars. It is shown that all library patterns are stored stably. On the other hand spurious memories may develop. Applications of this model to storage and retrieval of naturallyarising generalized sequences in bioinformatics are presented. The model is shown to work well for detection of novel generalized sequences against a large database of stored sequences, and for removal of noisy black pixels in a probe image against a very large set of stored images.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Connectionist rule processing using recursive auto-associative memory

A limitation of many rule-based connectionist models is their dependence on structure to explicitly represent rules, and their consequent inflexibility in acquiring and applying novel rules. A model is described in which recursive auto-associative memory (RAAM) is used as an encoding mechanism to prepare rules of variable structure and content for input to a connectionist rule applicator. The e...

متن کامل

Connectionist Network and its Application for Optimization

Connectionist network is the network of processing elements. These processing elements are connected with each other. It suggests that we may consider it as the fully connected network. The processing elements of this network are basically MP model neuron and normally, employee the bipolar non-linear output function. This network can be used as the associative memory if some constraints are imp...

متن کامل

Connectionist Rules of Language

A modular connectionist network is described that learns the German verb paradigm. The architecture of the network is in accordance with the rule{associative memory hypothesis proposed by Pinker (1991): it is composed of a connectionist short-term memory enabling it to process symbolic rules and an associative memory acting as a lexicon. The network successfully learns the German verb paradigm ...

متن کامل

Evaluation of Two Connectionist Approaches toStack

This study empirically compares two distributed connectionist learning models trained to represent an arbitrarily deep stack. One is Pol-lack's Recursive Auto-Associative Memory, a recurrent back propagating neural network that uses a hidden intermediate representation. The other is the Exponential Decay Model, a novel architecture that we propose here, which tries to learn an explicit represen...

متن کامل

Evaluation of Two Connectionist Approaches to Stack Representation

This study empirically compares two distributed connectionist learning models trained to represent an arbitrarily deep stack. One is Pol-lack's Recursive Auto-Associative Memory, a recurrent back propagating neural network that uses a hidden intermediate representation. The other is the Exponential Decay Model, a novel architecture that we propose here, which tries to learn an explicit represen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999